- inference tree
- дерево вывода
English-Russian electronics dictionary .
English-Russian electronics dictionary .
Tree rearrangement — Tree rearrangements are used in heuristic algorithms devoted to searching for an optimal tree structure. They can be applied to any set of data that are naturally arranged into a tree, but have most applications in computational phylogenetics,… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Bayesian inference in phylogeny — generates a posterior distribution for a parameter, composed of a phylogenetic tree and a model of evolution, based on the prior for that parameter and the likelihood of the data, generated by a multiple alignment. The Bayesian approach has… … Wikipedia
Phylogenetic tree — ptree redirects here. For Patricia tree, see Radix tree … Wikipedia
Arbre de jonction (Junction Tree) — Construction du Junction Tree Construction d un Junction Tree Qu est ce qu un Arbre de Jonction? (Junction tree) … Wikipédia en Français
Chow-Liu tree — A first order dependency tree representing the product on the left. A Chow Liu tree is an efficient method for constructing a second order product approximation of a joint distribution, first described in a paper by Chow Liu (1968). The goals of… … Wikipedia
Least squares inference in phylogeny — generates a phylogenetic tree based on anobserved matrix of pairwise genetic distances andoptionally a weightmatrix. The goal is to find a tree which satisfies the distance constraints asbest as possible.Ordinary and weighted least squaresThe… … Wikipedia
Decision tree learning — This article is about decision trees in machine learning. For the use of the term in decision analysis, see Decision tree. Decision tree learning, used in statistics, data mining and machine learning, uses a decision tree as a predictive model… … Wikipedia
Maximum clade credibility tree — A maximum clade credibility tree is a tree that summarises the results of a Bayesian phylogenetic inference. Whereas a majority rule tree combines the most common clades, potentially resulting in a tree that was not sampled during the analysis,… … Wikipedia
Junction tree algorithm — The junction tree algorithm is a method used in machine learning for exact marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The basic premise is to eliminate… … Wikipedia
Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… … Wikipedia